Verifying the Logical Termination of Workflows
نویسندگان
چکیده
Systems and infrastructures are currently being developed to support e-commerce activities. Workflow management systems and workflows are one of the strong technological candidates to deploy and support e-commerce applications. E-commerce workflows require a precise modeling to ensure that they perform according to initial specifications. Important advancements have been accomplished in the development of theoretical foundations for workflow modeling, verification, and analysis. Nevertheless, more research is required. It is essential to explore the use of formal methods for the modeling and verification of workflow’s properties. In this paper we present a formal framework, based on control flow graphs theory, to verify the correctness of workflows. In our approach, workflows are modeled with tri-logic acyclic directed graphs. The formalism developed allows to verify one important property, the logical termination of workflows.
منابع مشابه
Verifying the Termination of Workflows
In this paper we describe the behavior of workflows using graph theory and logic. A workflow is an abstraction of a business process that consists of one or more tasks to be executed to reach the goal or objective of the business process. Graphs are a formal notation that may be used for representing business processes. We use propositional logic to describe all possible models or cases present...
متن کاملLogical Termination of Workflows: An Interdisciplinary Approach
In this paper we present a new formalism to study the structure of workflows. A workflow is an abstraction of a business process that consists of one or more activities that need to be executed to reach a final objective. Our formalism is based on Graph Theory, Propositional Logic, and Boolean matrices. Indeed, we model workflows with tri-logic acyclic directed graphs. Moreover, we analyze the ...
متن کاملA Resource-Based Logic for Termination and Non-Termination Proofs (Technical Report)
We propose a unified logical framework for specifying and proving both termination and non-termination of various programs. Our framework is based on a resource logic which captures both upper and lower bounds on resources used by the programs. By an abstraction, we evolve this resource logic for execution length into a temporal logic with three predicates to reason about termination, non-termi...
متن کاملA Resource-Based Logic for Termination and Non-termination Proofs
We propose a unified logical framework for specifying and proving both termination and non-termination of various programs. Our framework is based on a resource logic which captures both upper and lower bounds on resources used by the programs. By an abstraction, we evolve this resource logic for execution length into a temporal logic with three predicates to reason about termination, non-termi...
متن کاملStoring and Efficiently Querying Critical Workflows from Log in Scientific Exploration
Existing workflow management systems assume that scientists have a clear and well-specified workflow design before the execution. In reality, a lot of scientific discoveries are made as the result of a dynamic process, where scientists keep on proposing new hypotheses and verifying them through multiple tries of various experiments before achieving to a successful stage. Consequently, not all t...
متن کامل